compress/flate.tableEntryPrev.prev (field)

49 uses

	compress/flate (current package)
		deflatefast.go#L145: 	prev tableEntry
		level3.go#L43: 			if v.prev.offset <= minOff {
		level3.go#L44: 				v.prev.offset = 0
		level3.go#L46: 				v.prev.offset = v.prev.offset - e.cur + maxMatchOffset
		level3.go#L90: 			e.table[nextHash] = tableEntryPrev{prev: candidates.cur, cur: tableEntry{offset: s + e.cur}}
		level3.go#L101: 				if candidates.prev.offset < minOffset || uint32(cv) != loadLE32(src, candidates.prev.offset-e.cur) {
		level3.go#L106: 				o2 := s - (candidates.prev.offset - e.cur)
		level3.go#L109: 					candidate = candidates.prev
		level3.go#L115: 				candidate = candidates.prev
		level3.go#L159: 						prev: e.table[nextHash].cur,
		level3.go#L170: 					prev: e.table[nextHash].cur,
		level3.go#L179: 				prev: e.table[prevHash].cur,
		level3.go#L186: 				prev: e.table[prevHash].cur,
		level3.go#L194: 				prev: candidates.cur,
		level3.go#L207: 				candidate = candidates.prev
		level5.go#L45: 				v.prev.offset = 0
		level5.go#L48: 				if v.prev.offset <= minOff {
		level5.go#L49: 					v.prev.offset = 0
		level5.go#L51: 					v.prev.offset = v.prev.offset - e.cur + maxMatchOffset
		level5.go#L105: 			eLong.cur, eLong.prev = entry, eLong.cur
		level5.go#L116: 					eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level5.go#L118: 					t2 := lCandidate.prev.offset - e.cur
		level5.go#L130: 				t = lCandidate.prev.offset - e.cur
		level5.go#L135: 					eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level5.go#L149: 				eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level5.go#L164: 					t2 = lCandidate.prev.offset - e.cur
		level5.go#L241: 			eLong.cur, eLong.prev = t, eLong.cur
		level5.go#L247: 			eLong.cur, eLong.prev = t, eLong.cur
		level5.go#L261: 				eLong.cur, eLong.prev = t, eLong.cur
		level5.go#L274: 		eLong.cur, eLong.prev = tableEntry{offset: o}, eLong.cur
		level6.go#L45: 				v.prev.offset = 0
		level6.go#L48: 				if v.prev.offset <= minOff {
		level6.go#L49: 					v.prev.offset = 0
		level6.go#L51: 					v.prev.offset = v.prev.offset - e.cur + maxMatchOffset
		level6.go#L104: 			eLong.cur, eLong.prev = entry, eLong.cur
		level6.go#L118: 					eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level6.go#L121: 					t2 := lCandidate.prev.offset - e.cur
		level6.go#L134: 				t = lCandidate.prev.offset - e.cur
		level6.go#L139: 					eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level6.go#L155: 				eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level6.go#L184: 					t2 = lCandidate.prev.offset - e.cur
		level6.go#L229: 				t2 = eLong.prev.offset - e.cur - l + skipBeginning
		level6.go#L269: 				eLong.cur, eLong.prev = tableEntry{offset: i + e.cur}, eLong.cur
		level6.go#L282: 			eLong.cur, eLong.prev = t, eLong.cur
		level6.go#L283: 			eLong2.cur, eLong2.prev = t2, eLong2.cur